A Study of Bacterial Foraging Optimization Algorithm and its Applications to Solve Simultaneous Equations

نویسندگان

  • Gautam Mahapatra
  • Soumya Banerjee
  • C. Wu
  • N. Zhang
  • J. Jiang
  • J. Yang
چکیده

For the solution of a set equation (linear or non-linear) with n number (n > 1) of variables we need at least n number of different relations (called as rank). Our present work is showing how the bio-inspired Bacteria Foraging Optimization Algorithm (BFOA), which is mimicry of the life-cycle of common type of bacteria like E. Coli, can be used to solve such system of equation with rank less than or equal to n. The BFOA simulates efficient nutrient foraging technique called as Chemotaxis to maximize the intake energy per unit time spend, the reproduction for evolution and the elimination-dispersal for environmental changes like any kind of natural calamities that are observed in the Bacterial system. As a sample tests we have used a numbers of system of linear equations with rank equal to the number of variables and a system of non-linear equations used in the derivation process of 4th order Runge-Kutta method for the ordinary differential equation solution, and experimental results are showing the applicability of the BFOA and in case of Runge-Kutta method we present an alternative form of the recursive equation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sub-transmission sub-station expansion planning based on bacterial foraging optimization algorithm

In recent years, significant research efforts have been devoted to the optimal planning of power systems. Substation Expansion Planning (SEP) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future load demand. The large number of design variables and combination of discr...

متن کامل

An Efficient Meta Heuristic Algorithm to Solve Economic Load Dispatch Problems

The Economic Load Dispatch (ELD) problems in power generation systems are to reduce the fuel cost by reducing the total cost for the generation of electric power. This paper presents an efficient Modified Firefly Algorithm (MFA), for solving ELD Problem. The main objective of the problems is to minimize the total fuel cost of the generating units having quadratic cost functions subjected to lim...

متن کامل

Substation Expansion Planning Based on BFOA

In recent years, significant research efforts have been devoted to the optimal planning of power systems. Substation Expansion Planning (SEP) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future demand. The large number of design variables, and combination of discrete ...

متن کامل

Control of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

متن کامل

Control of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013